﻿//https://leetcode.cn/problems/maximize-sum-of-array-after-k-negations/

class Solution {
public:
    vector<string> sortPeople(vector<string>& names, vector<int>& heights)
    {
        int n = heights.size();
        vector<int> index(n);
        for (int i = 0; i < n; i++) index[i] = i;

        sort(index.begin(), index.end(), [&](int i, int j)
            {
                return heights[i] > heights[j];
            });

        vector<string> ret;
        for (int i : index)
        {
            ret.push_back(names[i]);
        }

        return ret;

    }
};